Efficient congruencing in ellipsephic sets: the quadratic case

In this paper, we bound the number of solutions to a quadratic Vinogradov system equations in which variables are required satisfy digital restrictions given base. Certain sets permitted digits, namely those giving rise few representations natural numbers as sums elements digit set, allow us obtain better bounds than would be possible using size set alone. particular, when digits squares, diagonal behaviour with 12 variables.